| 1. | In the problems of minimax tree search , what we are looking for is often the optimal branch at the root node
在极大极小树搜索时，我们经常寻找的是根节点的最优分支。 |
| 2. | This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms
这使得prbfm成为将来多核处理器( cmp )多线程游戏树搜索benchmark的一个有力的备选算法。 |
| 3. | Conduct a tree search . ask people to find large , unusual or historic trees in your community . tell people to take care of them
组织一次寻找珍贵树木的活动，让人们发现社区内的参天大树、罕见的树或者具有历史意义的树木，号召人们保护好这些树。 |
| 4. | This thesis discloses some key workload characteristics of tree search applications in some sense , while gives some data support to design intel platform ’ s chip multprocessor
本文在一定程度上揭示了并行树搜索程序在smp平台上的关键负载特征,为intel平台设计多核处理器提供了一些数据支持。 |
| 5. | Game - tree search plays an important role in the field of artificial intelligence . in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon
游戏树搜索( game - treesearch )一直以来在人工智能领域扮演着极其重要的角色,并行游戏树搜索更是该领域的热点研究问题。 |
| 6. | The sequences are transformed to a relative sequence , in which all the segments are normalized by the previous segment . the relative sequences are categorized and indexed by suffix tree , and the result of the suffix tree search is the potential similar subsequences
通过将序列变换为相对序列，实现了对序列中任意位置、任意长度子序列的规范化；为了提高查询效率，将相对序列的特征向量进行离散化分类，并使用后缀树进行索引。 |
| 7. | To explain how to use the heuristics information of the problem to construct constraint - based solving algorithm , the general constraint satisfaction solving technology was briefly introduced , then the principles and the applicability of constraint propagation algorithm , tree search algorithm and heuristics repair algorithm for job shop scheduling were summarized
摘要为了说明如何利用启发式信息构造车间调度的约束满足求解算法，首先概述了常规约束满足求解技术，进而介绍了车间调度问题的约束传播算法、树搜索算法和启发式修复算法的构造原理及适用性。 |
